Application of the Microsoft Excel Solver tool in the solution of optimization problems of heat exchanger network systems

Optimization of heat exchanger networks (HEN_S) is a field of interest in Chemical Engineering. The aim is to use the residual heat of process streams to raise the temperature of other process streams which are cold, thus minimizing the use of hot and cold utilities. The usual way to deal with this task is to pose a linear programming problem according to a transshipment model in order to minimize either the general services consumptions or the number of hot and cold stream matchings required. This optimization is subjected to several restrictions given by the energy balances corresponding to each heat exchange.The high number of variables and equations obliges the use of specific software to solve these problems, e.g. GAMS (General Algebraic Modelling System). However, this software is not intuitive and requires a long time of training and a certain level of practice for the students to adequately use it.This work describes the use of Microsoft Excel-Solver for the sequential solving of HEN_S optimization problems according to the transshipment model. Solver is a much simpler, intuitive and easily available tool for the students who, besides, usually learn how to use it in the first years of their degree, in Informatics or similar subjects. Thus, it is not necessary to spend extra time in the teaching of the software, time that may be devoted to other contents.This paper presents an example of HEN_S problem proposed in the subject Simulation and Optimization of Chemical Processes corresponding to the Joint Master in Chemical Engineering of the Rey Juan Carlos University and the Autónoma University of Madrid and solved by the students using Excel-Solver.     

The generalized discrete ‐centroid problem

The ‐centroid problem or leader–follower problem is generalized considering different customer choice rules where a customer may use facilities belonging to different firms, if the difference in travel distance (or time) is small enough. Assuming essential goods, some particular customer choice rules are analyzed. Linear programming formulations for the generalized ‐medianoid and ‐centroid problems are presented and an exact solution approach is applied. Some computational examples are included.     

Chaos-Based transmitted-reference ultra-wideband communications

Transmitted-reference (TR) ultra-wideband (UWB) communication systems have gained increasing popularity for the usage in the low data rate application, due to its non-coherent receiver structure. In conventional TR system, non-coherency at the receiver is achieved by sending reference pulses prior to the data-bearing pulses. Then, at the receiver side, reference pulses are used as template signals for correlation with data-bearing pulses. Therefore, the orthogonality between reference and data pulses is obtained in time division multiple access (TDMA) fashion. However, the implementation of a wideband delay line is very difficult in the current low power integrated circuits. In this paper, a TR method called Chaos-Based TR (CB-TR) is proposed. In the proposed method, chaotic sequences are used to separate the reference and data pulses. Such approach exploits the benefits of chaotic signals, such as non-periodicity, easy-to-generate, impulse-like autocorrelation value and low cross-correlation value. Furthermore, in order to decrease the influence of some negative properties of conventional chaotic maps, a modified chaotic generator (MCS) is proposed. Simulation results over the IEEE 802.15.4a channel model show comparable bit error rate performance to other TR methods.     

内蒙古察哈尔蒙古族传统服饰的简繁艺术特征解读

察哈尔传统服饰是蒙古族28个部落传统服饰中的一支,具有突出的形制之简、色彩之素、头饰之繁、佩饰之多的艺术特征,在众多的蒙古族服饰中独树一帜。文章通过对察哈尔蒙古族现主要居住地锡林郭勒和乌兰察布地区的田野调查和历史文献调研,运用艺术学和民俗学的视角,概括其独特的简繁艺术特点,探讨该族群如何通过适简与从繁的服饰礼仪功能来构建民俗生活。研究表明,察哈尔蒙古族传统服饰的简与繁不仅是一种艺术特征,也是族群历史记忆的载体和身份建构的工具,其形成原因受到历史中军事职能、宫廷文化和游牧生活三者的共同塑造,并影响至今。     

Design of energy‐efficient train speed profiles considering fixed‐block signaling system

In dense traffic railway networks, trains may often slow down or stop between stations owing to previous train delays. If preceding train trajectory can be predicted, energy‐efficient driving can be achieved by suppressing unnecessary speed changes. In this paper, we propose an algorithm to find energy‐efficient driving considering fixed‐block signaling (FBS) system by using dynamic programming (DP). DP is suitable for use because it can optimize the control inputs with discrete and state constraints. In this paper, we discuss energy‐efficient driving by considering a FBS system using some case studies of simulation. In the simulation, we examine a technique to drive an express train in an energy‐efficient way when the preceding local train is running toward the station with passing loops. The results show that the proposed method can derive complex speed profiles for energy‐efficient driving and the train can be operated with a maximum reduced energy consumption of 8.3%.     

珲春地区高瓦斯矿井煤自然发火标志气体研究

为了探究珲春地区高瓦斯矿井煤自然发火情况，选取该地区板石煤矿22、23a和八连城煤矿18#、26#共4个煤层进行程序升温特性实验，分析了CO及烃类气体产生量随温度的变化规律，优选自然发火标志气体，测算煤自燃临界温度。结果表明，板石22、23a和八连城18#、26#四个煤层的自燃临界温度分别为101.0℃、97.6℃、121.0℃、169.1℃。CO和C2H4的初现温度大约在30℃与80～120℃，且产生量随温度单调递增，可作为煤自燃预测预报的主要参考指标|而同时，为了保证检测的全面与准确，还可以将规律性良好的其他烃类气体、烯烷比和链烷比进行辅助参考。     

机翼极限环颤振的CFD/CSD全隐式紧耦合方法

针对轴承振动实时状态监控的需要，从符号动力学角度提出了符号聚合近似与Lempel-ziv复杂度（SAX-LZC）融合的振动监控参数。首先，以Logistic映射和Duffing方程为对象，从理论角度验证了SAX-LZC对动力学结构表征的准确性，并验证了该指标的抗噪能力和计算效率；其次，将SAX-LZC指标与信息熵、样本熵、多分段Lempel-ziv复杂度等动力学参数性能进行了综合对比；最后，从实验角度对轴承早期微弱异常进行了监测，并对轴承典型故障进行了特征提取。理论研究结果表明，SAX-LZC具有动力学结构表征准确、抗噪能力好、计算高效简洁等优点，克服了常规动力学参数工程应用能力弱的问题。实验研究结果表明，SAX-LZC对早期微弱异常有准确的监测，对不同种类故障具有较好的区分度，弥补了时域和频域对轴承微弱故障表征能力不足的缺陷，是一种轴承振动实时状态监控与故障特征提取的有效参数。     

楼宇型分布式能源系统设备容量和运行策略优化研究

设备容量优化和运行策略优化是分布式能源系统设计，运行的关键问题。为实现分布式能源系统的经济效益，能效水平和环境效益最大化，针对楼宇型分布式能源系统建立了相对普适化的物理模型和数学模型，以粒子群优化算法和线性规划相结合，采用两阶段优化方法计算系统的最优容量配置，并给出运行策略。以某写字楼的分布式能源系统为例，得到最优的系统设备容量和全年逐时运行策略，并采用遍历法验证计算结果的准确性。优化的分布式能源系统与传统供能系统相比，费用年值降低7.79%，年总能耗降低24.18%，污染物排放量减少了62.77 %。     

Probabilistic tree-based representation for solving minimum cost integer flow problems with nonlinear non-convex cost functions

The minimum cost flow problem (MCFP) is the most generic variation of the network flow problem which aims to transfer a commodity throughout the network to satisfy demands. The problem size (in terms of the number of nodes and arcs) and the shape of the cost function are the most critical factors when considering MCFPs. Existing mathematical programming techniques often assume the cost functions to be linear or convex. Unfortunately, the linearity and convexity assumptions are too restrictive for modelling many real-world scenarios. In addition, many real-world MCFPs are large-scale, with networks having a large number of nodes and arcs. In this paper, we propose a probabilistic tree-based genetic algorithm (PTbGA) for solving large-scale minimum cost integer flow problems with nonlinear non-convex cost functions. We first compare this probabilistic tree-based representation scheme with the priority-based representation scheme, which is the most commonly-used representation for solving MCFPs. We then compare the performance of PTbGA with that of the priority-based genetic algorithm (PrGA), and two state-of-the-art mathematical solvers on a set of MCFP instances. Our experimental results demonstrate the superiority and efficiency of PTbGA in dealing with large-sized MCFPs, as compared to the PrGA method and the mathematical solvers.